Max-Sum Goes Private

نویسندگان

  • Tamir Tassa
  • Roie Zivan
  • Tal Grinshpoun
چکیده

As part of the ongoing effort of designing secure DCOP algorithms, we propose P-MAX-SUM, the first private algorithm that is based on MAX-SUM. The proposed algorithm has multiple agents preforming the role of each node in the factor graph, on which the MAX-SUM algorithm operates. P-MAXSUM preserves three types of privacy: topology privacy, constraint privacy, and assignment/decision privacy. By allowing a single call to a trusted coordinator, P-MAX-SUM also preserves agent privacy. The two main cryptographic means that enable this privacy preservation are secret sharing and homomorphic encryption. Our experiments on structured and realistic problems show that the overhead of privacy preservation in terms of runtime is reasonable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants

One of the basic motivations for solving DCOPs is maintaining agents’ privacy. Thus, researchers have evaluated the privacy loss of DCOP algorithms and defined corresponding notions of privacy preservation for secured DCOP algorithms. However, no secured protocol was proposed for Max-Sum, which is among the most studied DCOP algorithms. As part of the ongoing effort of designing secure DCOP alg...

متن کامل

Multilevel Network Games

We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The n nodes are connected by a static network and each node can decide individually to become a gateway to the high-speed network. The goal of a node v is to minimize its private costs, i.e., the sum (SUM-game) or maximum (MAXgame) of communication distances from v to ...

متن کامل

Linear-Quadratic Uncertain Differential Game With Application to Resource Extraction Problem

Uncertain differential game investigates interactive decision making of players over time and the system dynamics can be described by an uncertain differential equation. This paper goes further to study the two players zero-sum uncertain differential game. In order to guarantee the saddle-point Nash equilibrium, a Max-Min theorem is provided. Furthermore, when the system dynamics is described b...

متن کامل

Public-Private Contractual Networks and Third Parties' Rights

* PD Dr. iur. (Fribourg/Switzerland), LL.M. (Frankfurt a.M.), attorney-at-law (Zurich), [email protected]. This research has been presented at the Second Max Planck PostDoc-Conference on European Private Law. I would like to thank Professor Pascal Pichonnaz (Fribourg, Switzerland) for supporting my application to the conference. Furthermore, I would like to thank all participants of the conferenc...

متن کامل

On the Asymptotic Optimality of Opportunistic Norm-Based User Selection with Hard SINR Constraint

Recently, user selection algorithms in combination with linear precoding have been proposed that achieve the same scaling as the sum capacity of the MIMO broadcast channel. Robust opportunistic beamforming, which only requires partial channel state information for user selection, further reduces feedback requirements. In this work, we study the optimality of the opportunistic norm-based user se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015